Interaction Graphs for Multivariate Binary Data
نویسندگان
چکیده
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional dependency structure between the underlying stochastic variables at a finer scale than with classical probabilistic Graphical Models. A model selection strategy is derived based on an iterative optimization procedure and the consistency problem is discussed. We include the analysis of two data-sets to illustrate the proposed approach.
منابع مشابه
A New Surface Tension Model for Prediction of Interaction Energy between Components and Activity Coefficients in Binary Systems
In this work, we develop a correlative model based on the surface tension data in order to calculate thermodynamic parameters, such as interaction energy between components (Uij), activity coefficients and etc. In the new approach, by using Li et al. (LWW) model, a three-parameter surface tension equation is derived for liquid mixtures. The surface tension data of 54 aqueous and 73 non-aqueous ...
متن کاملThe Analysis of Bayesian Probit Regression of Binary and Polychotomous Response Data
The goal of this study is to introduce a statistical method regarding the analysis of specific latent data for regression analysis of the discrete data and to build a relation between a probit regression model (related to the discrete response) and normal linear regression model (related to the latent data of continuous response). This method provides precise inferences on binary and multinomia...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملVLE Predictions of Strongly Non-Ideal Binary Mixtures by Modifying Van Der Waals and Orbey-Sandler Mixing Rules
By proposing a predictive method with no adjustable parameter and by using infinite dilution activity coefficients of components in binary mixtures obtained from UNIFAC model, the binary interaction parameters (k12) in van der Waals mixing rule (vdWMR) and Orbey-Sandler mixing rule (OSMR) have been evaluated. The predicted binary interaction parameters are used in Peng-Robinson-S...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کامل